strings.stringFinder.badCharSkip (field)

5 uses

	strings (current package)
		search.go#L23: 	badCharSkip [256]int
		search.go#L58: 	for i := range f.badCharSkip {
		search.go#L59: 		f.badCharSkip[i] = len(pattern)
		search.go#L65: 		f.badCharSkip[pattern[i]] = last - i
		search.go#L114: 		i += max(f.badCharSkip[text[i]], f.goodSuffixSkip[j])